Query-Number Preserving Reductions and Linear Lower Bounds for Testing
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملTight Lower Bounds for Testing Linear Isomorphism
We study lower bounds for testing membership in families of linear/affine-invariant Boolean functions over the hypercube. A family of functions P ⊆ {{0, 1} → {0, 1}} is linear/affine invariant if for any f ∈ P , it is the case that f ◦L ∈ P for any linear/affine transformation L of the domain. Motivated by the recent resurgence of attention to the permutation isomorphism problem, we first focus...
متن کاملDistribution Testing Lower Bounds via Reductions from Communication Complexity
We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model. Extending the framework of Blais, Brody, and Matulef [15], we show a simple way to reduce (private-coin) SMP problems to distribution testing problems. This method allows us to prove new distribution te...
متن کاملOptimal Lower Bounds for 2-Query Locally Decodable Linear Codes
This paper presents essentially optimal lower bounds on the size of linear codes C : {0, 1} → {0, 1} which have the property that, for constants δ, > 0, any bit of the message can be recovered with probability 1 2 + by an algorithm reading only 2 bits of a codeword corrupted in up to δm positions. Such codes are known to be applicable to, among other things, the construction and analysis of inf...
متن کاملLower Bounds for Oblivious Transfer Reductions
We prove the rst general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length`should be invoked so as to obtain, by an information-theoretically secure reduction, a 1-out-of-N Oblivious Transfer of strings of length L. Our bound is tight in many signiicant cases. We also prove the rst non-trivial lower bound for the number of random bits neede...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.233